منابع مشابه
Logarithmic density and logarithmic statistical convergence
In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...
متن کاملLogarithmic tensor category theory, II: Logarithmic formal calculus and properties of logarithmic intertwining operators
This is the second part in a series of papers in which we introduce and develop a natural, general tensor category theory for suitable module categories for a vertex (operator) algebra. In this paper (Part II), we develop logarithmic formal calculus and study logarithmic intertwining operators. In this paper, Part II of a series of eight papers on logarithmic tensor category theory, we develop ...
متن کاملLogarithmic parameters
Some physical parameters, that are positive by definition, appear often as reciprocal pairs, like an electrical resistivity ρ and the electrical conductivity σ = 1/ρ , or a frequency ν and the period T = 1/ν . Theoretical arguments suggest that behind these pairs there are more natural parameters: their logarithms. This paper suggests a terminology that could bring those logarithmic units into ...
متن کاملOn the logarithmic comparison theorem for integrable logarithmic connections
LetX be a complex analytic manifold, D ⊂ X a Koszul free divisor with jacobian ideal of linear type (e.g. a locally quasi-homogeneous free divisor), j : U = X −D →֒ X the corresponding open inclusion, E an integrable logarithmic connection with respect to D and L the local system of the horizontal sections of E on U . In this paper we prove that the canonical morphisms ΩX(logD)(E(kD)) −→ Rj∗L, j...
متن کاملMonotone Separation of Logarithmic Space from Logarithmic Depth
We show that the monotone analogue of logspace computation is more powerful than monotone log-depth circuits: monotone bounded fanin circuits for a certain function in monotone logspace require depth (lg 2 n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1982
ISSN: 0028-0836,1476-4687
DOI: 10.1038/297450b0